On (a, d)-vertex-antimagic total labeling of Harary graphs
نویسندگان
چکیده
Let G = (V, E) be a graph with v vertices and e edges. An (a, d)-vertex-antimagic total labeling is a bijection λ from V (G) ∪ E(G) to the set of consecutive integers 1, 2, . . . , v + e, such that the weights of the vertices form an arithmetic progression with the initial term a and common difference d. If λ(V (G)) = {1, 2, . . . , v} then we call the labeling a super (a, d)-vertex-antimagic total. In this paper we construct (a, d)-vertex-antimagic total labeling on Harary graphs as well as for the disjoint union of k identical copies of Harary graphs.
منابع مشابه
On super antimagic total labeling of Harary graph
This paper deals with two types of graph labelings namely, the super (a, d)-edge antimagic total labeling and super (a, d)-vertex antimagic total labeling on the Harary graph C n. We also construct the super edge-antimagic and super vertex-antimagic total labelings for a disjoint union of k identical copies of the Harary graph.
متن کاملTotally antimagic total graphs
For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, . . . , |V (G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge. The vertex-weight of a vertex is the sum of the label of the vertex and the labels of all the edges incident with that vertex. A total label...
متن کاملA class of totally antimagic total graphs
A total labeling of a graph G is a bijection from the vertex set and edge set of G onto the set {1, 2, . . . , |V (G)| + |E(G)|}. Such a labeling ξ is vertex-antimagic (edge-antimagic) if all vertex-weights wtξ(v) = ξ(v) + ∑ vu∈E(G) ξ(vu), v ∈ V (G), (all edge-weights wtξ(vu) = ξ(v) + ξ(vu) + ξ(u), vu ∈ E(G)) are pairwise distinct. If a labeling is simultaneously vertex-antimagic and edge-antim...
متن کاملVertex-antimagic total labelings of graphs
In this paper we introduce a new type of graph labeling, the (a, d)vertex-antimagic total labeling, which is a generalization of several other types of labelings. A connected graph G(V, E) is said to be (a, d)-vertex-antimagic total if there exist positive integers a, d and a bijection λ : V ∪ E → {1, 2, . . . , |V | + |E|} such that the induced mapping gλ : V → W is also a bijection, where W =...
متن کاملSuper (a, d)-edge antimagic total labelings of friendship graphs
An (a, d)-edge-antimagic total labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices and edges to the set of positive integers {1, 2, 3, . . . , p + q} such that all the edge-weights w(uv) = f(u) + f(v) + f(uv);uv ∈ E(G), form an arithmetic progression starting from a and having common difference d. An (a, d)-edgeantimagic total labeling is called a sup...
متن کامل